Mesh Decimation Using VTK
نویسنده
چکیده
This paper describes general mesh decimation methods which operate on triangle meshes. The goal of the mesh decimation is the reduction of triangles in a mesh while preserving the shape and topology as good as possible. Further the usage of mesh decimation with the Visualization Tool Kit (VTK) is explained. Currently VTK (version 4.0, June 2002) contains four mesh decimation classes: vtkDecimate, vtkDecimatePro, vtkQuadricDecimation and vtkQuadricClustering. The paper describes also the differences between those classes.
منابع مشابه
Implementing a Visualization Tool for Adaptive Mesh Refinement Data using VTK
We are currently working with several research groups who use adaptive mesh refinement, AMR, techniques for calculations in computational fluid dynamics and cosmology. The computational fluid dynamics group needed a visualization tool to visualize AMR data and to distribute with their AMR library. Since none of the widely available visualization systems directly supported visualizing AMR data, ...
متن کاملA Hyper Tree Grid Implementation for AMR Mesh Manipulation and Visualization in VTK∗
Adaptive Mesh Refinement (AMR) grids are particularily efficient to mitigate the tension between numerical accuracy and computational cost. The Visualization Toolkit (VTK) offers data structures and algorithms to treat 2D and 3D AMR meshes, either “patch-based” or as binary trees. This paper summarizes our extension of the former capability to the case of generic subdivision and arbitrary recti...
متن کاملA parametric-associative modelling of aeronautical concepts for structural optimisation
In this work, a scheme of representation for aircraft structural concepts is identified. Based on this scheme, a parametric–associative geometrical modelling of the aeronautic structure, consisting in a quad-mapped mesh, is proposed. The mesh generation is based on a hierarchical scheme ensuring the one-to-one correspondence between mesh elements belonging to adjacent primitives. The automatic ...
متن کاملA Stream Algorithm for the Decimation of Massive Meshes
We present an out-of-core mesh decimation algorithm that is able to handle input and output meshes of arbitrary size. The algorithm reads the input from a data stream in a single pass and writes the output to another stream while using only a fixed-sized in-core buffer. By applying randomized multiple choice optimization, we are able to use incremental mesh decimation based on edge collapses an...
متن کاملFast geodesic distance approximation using mesh decimation and front propagation
Polygon meshes are collections of vertices, edges and faces defining surfaces in a 3D environment. Computing geometric features on a polygon mesh is of major interest for various applications. Among these features, the geodesic distance is the distance between two vertices following the surface defined by the mesh. In this paper, we propose an algorithm for fast geodesic distance approximation ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002